Clique Is Hard to Approximate within n1-o(1)

نویسندگان

  • Lars Engebretsen
  • Jonas Holmerin
چکیده

It was previously known that Max Clique cannot be approximated in polynomial time within n1− , for any constant > 0, unless NP = ZPP. In this paper, we extend the reductions used to prove this result and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2 n(log logn) 3/2)), clique cannot be approximated within n1−O(1/ √ log .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new approach to the planted clique problem

It is well known that finding the largest clique in a graph is NP-hard, [8]. Indeed, Hastad [5] has shown that it is NP-hard to approximate the size of the largest clique in an n vertex graph to within a factor n1−ǫ for any ǫ > 0. Not surprisingly, this has directed some researchers attention to finding the largest clique in a random graph. Let Gn,1/2 be the random graph with vertex set [n] in ...

متن کامل

Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

In this paper, we present improved inapproximability results for three problems : the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. Håstad’s celebrated result [13] shows that the maximum clique size in a graph with n vertices is inappr...

متن کامل

Towards optimal lower bounds for clique and chromatic number

It was previously known that neither Max Clique nor Min Chromatic Number can be approximated in polynomial time within n1− , for any constant > 0, unless NP = ZPP. In this paper, we extend the reductions used to prove these results and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2 logn) 3/2)), neither Max Clique nor Min Chro...

متن کامل

Hardness of approximation of the Balanced Complete Bipartite Subgraph problem

We prove that the Maximum Balanced Complete Bipartite Subgraph (BCBS) problem is hard to approximate within a factor of 2 n) δ for some δ > 0 under the plausible assumption that 3-SAT ∈ DTIME ( 2 3/4+ ) for some > 0. We also show that it is NP -hard to approximate the BCBS problem within a constant factor under the assumption that it is NP -hard to approximate the maximum clique problem within ...

متن کامل

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

The existence of a densely knit core surrounded by a loosely connected periphery is a common macro-structural feature of social networks. Formally, the CorePeriphery problem is to partition the nodes of an undirected graph G = (V,E) such that a subset X ⊂ V , the core, induces a dense subgraph, and its complement V \X, the periphery, induces a sparse subgraph. Split graphs represent the ideal c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000